#include<bits/stdc++.h>
using namespace std;
int n,a[100005];
bool f[100005],di[100005];
int main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
    cin >> n;
    for(int i = 1;i <= n;i++){
    	cin >> a[i];
    	f[i]=1;
    	di[i]=1;
    }
    sort(a+1,a+n+1);
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= i;j++){
        	if(a[i] >= a[j]){
        		if(di[j] == 1&&f[i]==1){
        		    if(a[i]>a[j]){
        		    	di[j]=0;
        		    	f[j]=f[i]=0;
        		    }else if(a[i]==a[j])f[j]=0;
        		}else continue;
           	}
        }
    }
    int cnt=0;
    for(int i = 1;i <= n;i++){
    	if(di[i]==1)cnt++;
    }
    cout << cnt;
	return 0;
}
